Proof Generation for Saturating First-Order Theorem Provers

نویسندگان

  • Stephan Schulz
  • Geoff Sutcliffe
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First-Order Proof Tactics in Higher-Order Logic Theorem Provers

In this paper we evaluate the effectiveness of first-order proof procedures when used as tactics for proving subgoals in a higher-order logic interactive theorem prover. We first motivate why such first-order proof tactics are useful, and then describe the core integrating technology: an ‘LCFstyle’ logical kernel for clausal first-order logic. This allows the choice of different logical mapping...

متن کامل

The chapter “ Proof Generation for Saturating First - Order Theorem Provers ”

This book is a collection of articles referring to the presentations delivered during a one-day workshop consisting of 12 invited tutorials. That workshop was a part of “Vienna Summer of Logic” in July 2014. The format itself (I did not attend the event) indicates tutorials of a moderate length devoted to a multitude of deduction tools. The reviewed volume consists of twelve chapters, i.e. pape...

متن کامل

Automated Reasoning: Past Story and New Trends

We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems, we also try to predict new trends in first-order automated reasoning. Our presentation will be centered around two main motives: efficiency and usefulness for existing and future potential applications. This paper ex...

متن کامل

Evaluating Automated Theorem Provers for First-Order Modal Logics

First-order modal logics have many applications, e.g., in planning, natural language processing, program verification, querying knowledge bases, and modeling communication. This paper gives an overview of several new implementations of theorem provers for first-order modal logics based on different proof calculi. Among these calculi are the standard sequent calculus, a prefixed tableau calculus...

متن کامل

HOL Provers for First-order Modal Logics - Experiments

Higher-order automated theorem provers have been employed to automate first-order modal logics. Extending previous work, an experiment has been carried out to evaluate their collaborative and individual performances.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014